Fast and exact audit scheduling optimization
نویسندگان
چکیده
Abstract This article is concerned with the cost and time-effective scheduling of financial auditors integer linear programming. The schedule optimization considers 13 different constraints, staff scarcity, frequent alterations input data need to minimize changes in generated schedule, scaling issues. delivered implementation reduced time first from 3 man-days 1 h update man-day 4 min.
منابع مشابه
Scheduling internal audit activities: a stochastic combinatorial optimization problem
The problem of finding the optimal timing of audit activities within an organisation has been addressed by many researchers. We propose a stochastic programming formulation with Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) certainty-equivalent models. In experiments neither approach dominates the other. However, the CP approach is orders of magnitude faster for large ...
متن کاملRecent Advances in Exact Optimization of Airline Scheduling Problems
We discuss the formulation and solution of large scale integer optimization problems that arise in the scheduling of transport related services. We rst set the context for these problems within the airline industry by discussing the scheduling process. We then discuss the two key activities of eet assignment and crew scheduling that turn a schedule into an operational plan. We provide current f...
متن کاملFast Drug Scheduling Optimization Approach for Cancer Chemotherapy
In this paper, we propose a novel fast evolutionary algorithm — cycle-wise genetic algorithm (CWGA) based on the theoretical analyses of a drug scheduling mathematical model for cancer chemotherapy. CWGA is more efficient than other existing algorithms to solve the drug scheduling optimization problem. Moreover, its simulation results match well with the clinical treatment experience, and can p...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملFast, Exact, Linear Booleans
We present a new system for robustly performing Boolean operations on linear, 3D polyhedra. Our system is exact, meaning that all internal numeric predicates are exactly decided in the sense of exact geometric computation. Our BSP-tree based system is 16-28× faster at performing iterative computations than CGAL’s Nef Polyhedra based system, the current best practice in robust Boolean operations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN applied sciences
سال: 2021
ISSN: ['2523-3971', '2523-3963']
DOI: https://doi.org/10.1007/s42452-021-04778-z